Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Source URL: www.paultaylor.eu

• Theory of computation
• Mathematical logic
• General topology
• Functional analysis
• Computable number
• Computable function
• Continuous function
• Baire space
• Topological space
• Computability theory
• Mathematics
• Topology

Interval Analysis Without Intervals Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Source URL: www.paultaylor.eu

• Locally compact space
• Duality
• Logic
• Equivalence of categories
• Stone duality
• Non-classical analysis
• Topology
• Mathematics
• General topology

Combinators for Bi-Directional Tree Transformations: A Linguistic Approach to the View Update Problem J. Nathan Foster Michael B. Greenwald

Source URL: www.cis.upenn.edu

• Computer science
• Principles of Programming Languages
• Computing
• Lambda calculus
• Logic in computer science
• Combinatory logic

8_Book.pdf

Source URL: users.uoa.gr

• Reasoning
• Epistemology
• Logical consequence
• Branches of philosophy
• Arguments
• Inference
• Evidentiality
• Verificationism
• Modus ponens
• Logic
• Science
• Knowledge

PSYCHOLOGISM AND THE COGNITIVE FOUNDATIONS OF MATHEMATICS Christophe Heintz Institut Jean Nicod

Source URL: christophe.heintz.free.fr

• Mathematics
• Epistemology
• Philosophers of science
• Philosophers of mathematics
• German Christians
• Intuition
• Edmund Husserl
• Psychologism
• Logic
• Philosophy
• Philosophy of mathematics
• Knowledge

Probability Theory: The Logic of Science by E. T. Jaynes Wayman Crow Professor of Physics

Source URL: www-biba.inrialpes.fr

LOGIC AND THE METHODOLOGY OF SCIENCE PRELIMINARY EXAMINATION Throughout this exam, we use the notation {We }e∈N for a standard listing of the recursively enumerable sets. 1. Prove or disprove: If N |= PA is a model of

Source URL: logic.berkeley.edu

αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu

Source URL: www.schemeworkshop.org

Visualization Designs for Constraint Logic Programming∗ Manuel Carro Manuel Hermenegildo Computer Science School — Technical University of Madrid Boadilla del Monte

Source URL: clip.dia.fi.upm.es

COMPUTER SCIENCE TRIPOS Part IB – 2013 – Paper 6 5 Logic and Proof (LCP) (a) In the context of clause methods in theorem proving, define and discuss the concept of a pure literal.

Source URL: www.cl.cam.ac.uk